A new Mahalanobis distance measure for clustering of fiber tracts

نویسندگان

  • C. Koay
  • C. Pierpaoli
  • P. J. Basser
چکیده

INTRODUCTION Data analysis in Diffusion Tensor Magnetic Resonance Imaging (DT-MRI) is highly sophisticated and can be thought of as a “pipeline” of closely connected processing and modeling steps. Cluster analysis of the orientation of the fiber direction and fiber tracts is typically carried on the major eigenvector. This type of cluster analysis is also important in reducing sorting bias in the eigenvalues of the diffusion tensor [1-3]. In this work, we present a simple and novel generalization of Mahalanobis distance measure for the dyadics of the eigenvector for the purposes of clustering fiber tracts and fiber orientation. This approach is built upon a series of works by Koay et al.[4-6], especially the error propagation framework for DT-MRI as presented in [5]. This approach is straight forward and the Mahalanobis distance measure for the dyadics can computed efficiently without ad hoc combinatorial optimization that is typical in the eigenvector-clustering techniques, e.g., [1,2]. The proposed Mahalanobis distance measure is the ideal measure for clustering fiber tracts. METHODS AND RESULTS The dyadics formalism is a relatively well known technique in DTI [1,7]. A dyadic tensor of a vector, T z y x q q q ] , , [ = q is simply the matrix outer product of q , which is given by:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Normalized Clustering Algorithm Based on Mahalanobis Distance

FCM (fuzzy c-means algorithm) based on Euclidean distance function converges to a local minimum of the objective function, which can only be used to detect spherical structural clusters. The added fuzzy covariance matrices in their distance measure were not directly derived from the objective function. In this paper, an improved Normalized Clustering Algorithm Based on Mahalanobis distance by t...

متن کامل

New distance and similarity measures for hesitant fuzzy soft sets

The hesitant fuzzy soft set (HFSS), as a combination of hesitant fuzzy and soft sets, is regarded as a useful tool for dealing with the uncertainty and ambiguity of real-world problems. In HFSSs, each element is defined in terms of several parameters with arbitrary membership degrees. In addition, distance and similarity measures are considered as the important tools in different areas such as ...

متن کامل

Unsupervised Clustering Algorithm Based on Normalized Mahalanobis Distances

Some of the well-known fuzzy clustering algorithms are based on Euclidean distance function, which can only be used to detect spherical structural clusters. Gustafson-Kessel clustering algorithm and Gath-Geva clustering algorithm were developed to detect non-spherical structural clusters. However, the former needs added constraint of fuzzy covariance matrix, the later can only be used for the d...

متن کامل

A new combined distance measure for the clustering of fiber tracts in Diffusion Tensor Imaging (DTI)

Introduction In recent years various fiber tractography methods have been evolved. Although these resulting tractograms offers plenty of information, they are rarely used in clinical routine, due to the fact that processing is often time-consuming and an experienced operator is essential to obtain good results. Apart from that, tractograms can be very useful for surgeons who need to know where ...

متن کامل

Applying the Mahalanobis-Taguchi System to Vehicle Ride

The Mahalanobis Taguchi System is a diagnosis and forecasting method for multivariate data. Mahalanobis distance is a measure based on correlations between the variables and different patterns that can be identified and analyzed with respect to a base or reference group. The Mahalanobis Taguchi System is of interest because of its reported accuracy in forecasting small, correlated data sets. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009